The Design of the Minimum Spanning Tree Algorithms
نویسندگان
چکیده
منابع مشابه
The Design of the Minimum Spanning Tree Algorithms
Based on the graphic theory and improved genetic algorithm, an improved genetic algorithm to search the minimum spanning trees is given. The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function, operator and few controlling strategies to improve its speed and evolutionary efficiency. Only one solution can be gotten with run...
متن کاملCommunication-optimal Parallel Minimum Spanning Tree Algorithms
Lower and upper bounds for nding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the rst non-trivial lower bounds on the communication volume required to solve the MST problem. Let p denote the number of processors, n the number of nodes of the input graph, and m the number of edges of the input graph. We show that in the worst case, a tot...
متن کاملGreedy Algorithms for Minimum Spanning Tree
The glossary de nes a spanning tree for a connected graph with non-negative weights on its edges, and one problem: nd a max weight spanning tree. Remarkably, the greedy algorithm results in a solution. Here we present similar greedy algorithms due to Prim [3] and Kruskal [2], respectively, for the problem: nd a min weight spanning tree. Graham and Hell [1] gives a history of the problem, which ...
متن کاملEvaluating Minimum Spanning Tree Based Segmentation Algorithms
Two segmentation methods based on the minimum spanning tree principle are evaluated with respect to each other. The hierarchical minimum spanning tree method is also evaluated with respect to human segmentations. Discrepancy measure is used as best suited to compute the segmentation error between the methods. The evaluation is done using gray value images. It is shown that the segmentation resu...
متن کاملHeuristic Algorithms for the Generalized Minimum Spanning Tree Problem
We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Information Management
سال: 2009
ISSN: 2160-5912,2160-5920
DOI: 10.4236/iim.2009.11010